Infinite weighted graphs with bounded resistance metric
نویسندگان
چکیده
منابع مشابه
On the Metric Dimension of Infinite Graphs
A set of vertices S resolves a graph G if every vertex is uniquely determined by its vector of distances to the vertices in S. The metric dimension of a graph G is the minimum cardinality of a resolving set. In this paper we study the metric dimension of infinite graphs such that all its vertices have finite degree. We give necessary conditions for those graphs to have finite metric dimension a...
متن کاملMetric Dimension of Bounded Tree-length Graphs
The notion of resolving sets in a graph was introduced by Slater (1975) and Harary and Melter (1976) as a way of uniquely identifying every vertex in a graph. A set of vertices in a graph is a resolving set if for any pair of vertices x and y there is a vertex in the set which has distinct distances to x and y. A smallest resolving set in a graph is called a metric basis and its size, the metri...
متن کاملA Sampling Theory for Infinite Weighted Graphs
We prove two sampling theorems for infinite (countable discrete) weighted graphs G; one example being “large grids of resistors” i.e., networks and systems of resistors. We show that there is natural ambient continuum X containing G, and there are Hilbert spaces of functions on X that allow interpolation by sampling values of the functions restricted only on the vertices in G. We sample functio...
متن کاملStrongly maximal matchings in infinite weighted graphs
Given an assignment of weights w to the edges of an infinite graph G, a matching M in G is called strongly w-maximal if for any matching N there holds ∑ {w(e) | e ∈ N \ M} ≤ ∑ {w(e) | e ∈ M \ N}. We prove that if w assumes only finitely many values all of which are rational then G has a strongly w-maximal matching. This result is best possible in the sense that if we allow irrational values or ...
متن کاملWeighted Automata and Logics on Infinite Graphs
We show a Büchi-like connection between graph automata and logics for infinite graphs. Using valuation monoids, a very general weight structure able to model computations like average or discounting, we extend this result to the quantitative setting. This gives us the first general results connecting automata and logics over infinite graphs in the qualitative and the quantitative setting.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: MATHEMATICA SCANDINAVICA
سال: 2018
ISSN: 1903-1807,0025-5521
DOI: 10.7146/math.scand.a-106208